Multi-item Vickrey-Dutch auctions

نویسندگان

  • Debasis Mishra
  • David C. Parkes
چکیده

Descending price auctions are adopted for goods that must be sold quickly and in private values environments, for instance in flower, fish, and tobacco auctions. In this paper, we introduce ex post efficient descending auctions for two environments: multiple non-identical items and buyers with unit-demand valuations; and multiple identical items and buyers with non-increasing marginal values. Our auctions are designed using the notion of universal competitive equilibrium (UCE) prices and they terminate with UCE prices, from which the Vickrey payments can be determined. For the unit-demand setting, our auction maintains linear and anonymous prices. For the homogeneous items setting, our auction maintains a single price and adopts Ausubel’s notion of “clinching” to compute the final payments dynamically. The auctions support truthful bidding in an ex post Nash equilibrium and terminate with an ex post efficient allocation. In simulation, we illustrate the speed and elicitation advantages of these auctions over their ascending price counterparts. This paper supersedes our two discussion papers titled“A Vickrey-Dutch Clinching Auction”and“MultiItem Vickrey-Dutch Auction for Unit Demand Preferences”. Parkes is supported in part by the National Science Foundation under Grant No. IIS-0331832, an IBM Faculty Award and a Sloan Foundation Fellowship. We thank seminar participants at 2003 Informs annual meeting, Harvard University, Indian Institute of Science, TÜ Berlin Workshop on Combinatorial Auctions, and University of Wisconsin-Madison for their feedback on earlier versions of this work. We also wish to acknowledge the constructive comments of the two anonymous reviewers and associate editor on an earlier version of this paper. Planning Unit, Indian Statistical Institute, New Delhi, India School of Engineering and Applied Sciences, Harvard University, Cambridge, MA, USA, [email protected]

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multi-Item Vickrey-Dutch Auction for Unit Demand Preferences

We consider an economy with one seller and m selfish buyers. The seller has n indivisible heterogeneous items to sell and each buyer wants at most one of those items. Buyers have private, independent and known value on the items. We propose an exact Vickrey-Dutch auction, where prices of appropriate items are decreased by unity in each iteration. This auction converges to Vickrey payoff point e...

متن کامل

Multi-item Vickrey-English-Dutch auctions

Assuming that bidders wish to acquire at most one item, this paper defines a polynomial time multiitem auction that locates the VCG prices in a finite number of iterations for any given starting prices. This auction is called the Vickrey-English-Dutch auction and it contains the Vickrey-English auction (J.K. Sankaran, Math. Soc. Sci. 28:143–150, 1994) and the Vickrey-Dutch auction (D. Mishra an...

متن کامل

Comparative analysis of multi-item online auctions: evidence from the laboratory

The dynamics of customer relationship are being reshaped by price-setting processes such as online auctions. This paper Ž . analyzes price setting process in business-to-consumer B2C online auctions. Typically, these auctions involve multiple identical units and utilize a variant of the traditional English-auction mechanism. We describe an online laboratory w experiment that compares the effici...

متن کامل

Secure Multi-attribute Procurement Auction

In this paper, we develop a secure multi-attribute procurement auction, in which a sales item is defined by several attributes called qualities, the buyer is the auctioneer (e.g., a government), and the sellers are the bidders. We first present a Vickrey-type protocol that can be used for multi-attribute procurement auctions. Next, we show how this protocol can be executed securely. key words :...

متن کامل

Optimal internet auctions with costly communication

Iterative auctions can reach an outcome before all bidders have revealed all their preference information. This can decrease costs associated with communication, deliberation, and loss of privacy. We propose an explicit cost model that is inspired by single-item Internet auctions, such as those taking place on auction sites (eBay) or via informal communication (craigslist, mailing lists). A non...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Games and Economic Behavior

دوره 66  شماره 

صفحات  -

تاریخ انتشار 2009